On 3-extra connectivity of k-ary n-cubes
نویسندگان
چکیده
Given a graph G, a non-negative integer g and a set of vertices S, the g-extra connectivity of G is the cardinality of a minimum set S such that G − S is disconnected and each component of G− S has at least g + 1 vertices. The 2-extra connectivity of k-ary n-cubes is gotten by Hsieh et al. in [Theoretical Computer Science, 443 (2012) 63-69] for k ≥ 4. This paper shows that the 3-extra connectivity of the k-ary n-cubes is 8n− 8, where n ≥ 3 and k ≥ 4.
منابع مشابه
Extra connectivity measures of 3-ary n-cubes
The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...
متن کاملAugmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...
متن کامل3-extra Connectivity of K-ary N-cube Networks
Let G be a connected graph and S be a set of vertices. The h-extra connectivity of G is the cardinality of a minimum set S such that G − S is disconnected and each component of G− S has at least h + 1 vertices. The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The h-extra connectivity for h = 1, 2 of k-ar...
متن کاملRestricted connectivity for three families of interconnection networks
Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity and super-connectivity, the concept of restricted vertex connectivity and restricted edge connectivity of graphs was proposed by Esfahanian [A.H. Es...
متن کاملLatency and Bandwidth Requirements of Massively Parallel Programs: FFT as a Case Study
Many theoretical models of parallel computation are based on overly simplistic assumptions on the performance of the interconnection network. For example they assume constant latency for any communication pattern or innnite bandwidth. This paper presents a case study based on the FFT transpose algorithm, which is mapped on two families of scalable interconnection networks, the k-ary n-trees and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013